The Coupon-collector's Problem Revisited
نویسنده
چکیده
Consider the classical coupon-collector's problem in which items of m distinct types arrive in sequence. An arriving item is installed in system i > 1 if i is the smallest index such that system i does not contain an item of the arrival's type. We study the expected number of items in system j at the moment when system 1 first contains an item of each type.
منابع مشابه
LIMIT lliEOREMS FOR AN EXTENDED COUPON COLLECTOR ' S PROBLEM AND FOR SUCCESSIVE SUBSAMPLING WIlli VARYING PROBABILITIES
Asymptotic normality as well as some weak invariance principles for bonus sums and waiting times in an extended coupon collector's problem are considered and incorporated in the study of the asymptotic distribution theory of estimators of (finite) population totals in successive sub-sampling (or multistage sampling) with varying probabilities (without replacements). Some applications of these t...
متن کاملSome New Aspects of the Coupon Collector's Problem
We extend the classical coupon collector’s problem to one in which two collectors are simultaneously and independently seeking collections of d coupons. We find, in finite terms, the probability that the two collectors finish at the same trial, and we find, using the methods of Gessel-Viennot, the probability that the game has the following “ballotlike” character: the two collectors are tied wi...
متن کاملThe Hypergeometric Coupon Collection Problem and its Dual
Suppose an urn contains M balls, of different types, which are removed from the urn in a uniform random manner. In the hypergeometric coupon collection problem, we are interested in the set of balls that have been removed at the moment when at least one ball of each type has been removed. In its dual, we are interested in the set of removed balls at the first moment that this set contains all o...
متن کاملSpringer (original Version in Lncs) a Generalized Cover Time for Random Walks on Graphs
Given a random walk on a graph, the cover time is the rst time (number of steps) that every vertex has been hit (covered) by the walk. Deene the marking time for the walk as follows. When the walk reaches vertex vi, a coin is ipped and with probability pi the vertex is marked (or colored). We study the time that every vertex is marked. (When all the pi's are equal to 1, this gives the usual cov...
متن کاملA Generalized Cover Time for Random Walks on Graphs
Abstract. Given a random walk on a graph, the cover time is the rst time (number of steps) that every vertex has been hit (covered) by the walk. De ne the marking time for the walk as follows. When the walk reaches vertex vi, a coin is ipped and with probability pi the vertex is marked (or colored). We study the time that every vertex is marked. (When all the pi's are equal to 1, this gives the...
متن کامل